An efficient partial matching algorithm toward speech retrieval by speech
نویسندگان
چکیده
This paper proposes a new efficient partial matching algorithm, called Island Driven Partial Matching (IDPM) based on Continuous Dynamic Programming (CDP), to realize flexible retrieval from a speech database by query speech. IDPM enables detecting the sections in the speech database which match partial sections of the query speech efficiently. IDPM applies CDP to short and constant length of unit reference patterns, which are composed of the query speech, and finds the best matching island sections in the speech database. Arbitrary lengths of similar sections are detected by only checking those islands sections. Some experiments were conducted for conversational speech and the results showed IDPM enables the fast matching between arbitrary sections of the reference pattern and the input speech without declining the performance in detecting similar sections compared with our former method.
منابع مشابه
An Algorithm for Extracting Similar Partial Utterances toward Flexible Spoken Document Retrieval
This paper proposes a new approach for spoken document retrieval by extracting similar partial utterances for non-segmented and non-recognized data; presentation speech, lecture speech or recorded video, and so on. For this purpose, we propose a new, efficient algorithm that performs fast matching between arbitrary sections of the database and arbitrary sections of query input. It enables searc...
متن کاملSpeech Enhancement using Adaptive Data-Based Dictionary Learning
In this paper, a speech enhancement method based on sparse representation of data frames has been presented. Speech enhancement is one of the most applicable areas in different signal processing fields. The objective of a speech enhancement system is improvement of either intelligibility or quality of the speech signals. This process is carried out using the speech signal processing techniques ...
متن کاملCross-Domain Approximate String Matching
Approximate string matching is an important paradigm in domains ranging from speech recognition to information retrieval and molecular biology. In this paper, we introduce a new formalism for a class of applications that takes two strings as input, each specified in terms of a particular domain, and performs a comparison motivated by constraints derived from a third, possibly different domain. ...
متن کاملQuery-by-Example using Speaker Content Graphs
We describe methods for constructing and using content graphs for query-by-example speaker recognition tasks within a large speech corpus. This goal is achieved as follows: First, we describe an algorithm for constructing speaker content graphs, where nodes represent speech signals and edges represent speaker similarity. Speech signal similarity can be based on any standard vector-based speaker...
متن کاملAuthor Verification using PPM with Parts of Speech Tagging
In this paper we describe a compression-based authorship verification model used in conjunction with a parts of speech tagger. We use standard language-specific parts of speech taggers on the texts in question to generate a stream of symbols representing each word, run the PPM (Prediction by Partial Matching) algorithm on the resulting stream, and use Bobicev’s method of calculating and compari...
متن کامل